Convolutional Codes II. Maximum-Likelihood Decoding
نویسنده
چکیده
Find the secret to improve the quality of life by reading this convolutional codes ii maximum likelihood decoding. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how well-known the work is. As wise word, never judge the words from who speaks, but make the words as your good value to your life.
منابع مشابه
Hybrid Maximum Likelihood Decoding for Linear Block Codes
In this paper we propose a hybrid maximum likelihood decoding (MLD) for linear block codes. For the reliable data transmission over noisy channels, convolutional and block codes are widely used in most digital communication systems. Much more efficient algorithms have been found for using channel measurement information in the decoding of convolutional codes than in the decoding of block codes....
متن کاملA State-Reduction Viterbi Decoder for Convolutional Codes with Large Constraint Lengths
A popular combination in modern coding system is the convolutional encoder and the Viterbi decoder [5]. With a proper design, they can jointly provide an acceptable performance with feasible decoding complexity. In such a combination, a tradeoff on the error performance and the decoding complexity resides on the choice of the code constraint length. Specifically, the probability of Viterbi deco...
متن کاملAnalysis of the Sufficient Path Elimination Window for the Maximum-Likelihood Sequential-Search Decoding Algorithm for Binary Convolutional Codes
In this work, the priority-first sequential-search decoding algorithm proposed in [8] is revisited. By replacing the conventional Fano metric by one that is derived based on the Wagner rule, the sequentialsearch decoding in [8] guarantees the maximum-likelihood (ML) performance, and hence, was named the maximum-likelihood sequential decoding algorithm (MLSDA). It was then concluded by simulatio...
متن کاملOn Optimality Test in Low Complexity Maximum Likelihood Decoding of Convolutional Codes
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA), complexity reduction methods such as the sphere decoder often use the sum log likelihood (SLL) of a Markov path as a bound to disprove (or test) the optimalit...
متن کاملA new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes
An upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetr ic channel is derived. The bound is evaluated for rate 1 / 2 codes, and comparisons are made with simulations and with the bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg’s bound for ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 25 شماره
صفحات -
تاریخ انتشار 1974